GPU Matrix Sort (An Efficient Implementation of Merge Sort)
نویسندگان
چکیده
منابع مشابه
Efficient unbalanced merge – sort q
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge–sort algorithm emerges indisputably as the most prominent method. In this paper we present a variant of merge–sort that proceeds through arbitrary merges between pairs of quasi-ordered subsequences, no matter w...
متن کاملMerge Sort
Bingheng Wang Dept. of Computer Science Florida Institute of Technology Melbourne FL 32904 [email protected] ABSTRACT Given a list of elements, we rearrange the list with ascending or descending order. So far the existing approaches involve Bubble Sort, Insertion Sort, Selection Sort ( respectively in worst case) performing slow. Now we introduce a new algorithm Merge Sort to solve the problem ...
متن کاملMerge Path – Cache-Efficient Parallel Merge and Sort
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Due to the extremely low compute to memoryaccess ratio, it is also critically important to efficiently utilize ...
متن کاملModified Merge Sort Algorithm
Given a sequence of N elements a1, a2, a3, ..., aN. The desired output will be a’1, a’2, a’3,..., a’N such that a’1≤, a’2≤, a’3≤...≤a’N using merge sort. In this paper, we propose a modification to the existing merge sort algorithm to sort the given elements when the input sequence (or a part of it) is in ascending or descending order in a more efficient way by reducing the number of comparison...
متن کاملMerge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion and Selection Sort all have a quadratic time complexity that limits their use when the number of elements is very big. In this paper, we introduce Merge Sort, a divide-andconquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity of merge sor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15729-4450